A Bisimulation-based Method for Proving the Validity of Equations in GSOS Languages
نویسندگان
چکیده
This paper presents a bisimulation-based method for establishing the soundness of equations between terms constructed using operations whose semantics is specified by rules in the GSOS format of Bloom, Istrail and Meyer. The method is inspired by de Simone’s FH-bisimilarity and uses transition rules as schematic transitions in a bisimulation-like relation between open terms. The soundness of the method is proven and examples showing its applicability are provided. The proposed bisimulation-based proof method is incomplete, but the article offers some completeness results for restricted classes of GSOS specifications. An extension of the proof method to the setting of GSOS languages with predicates is also offered.
منابع مشابه
Proving the validity of equations in GSOS languages using rule-matching bisimilarity
This paper presents a bisimulation-based method for establishing the soundness of equations between terms constructed using operations whose semantics is specified by rules in the GSOS format of Bloom, Istrail and Meyer. The method is inspired by de Simone’s FH-bisimilarity and uses transition rules as schematic transitions in a bisimulation-like relation between open terms. The soundness of th...
متن کاملCPO Models for GSOS Languages Part I: Compact GSOS Languages
In this paper, we present a general way of giving denotational semantics to a class of languages equipped with an operational semantics that fits the GSOS format of Bloom, Istrail and Meyer. The canonical model used for this purpose will be Abramsky’s domain of synchronization trees, and the denotational semantics automatically generated by our methods will be guaranteed to be fully abstract wi...
متن کاملCPO Models for a Class of GSOS Languages
In this paper, we present a general way of giving denotational semantics to a class of languages equipped with an operational semantics that ts the GSOS format of Bloom, Istrail and Meyer. The canonical model used for this purpose will be Abramsky's domain of synchronization trees, and the denotational semantics automatically generated by our methods will be guaranteed to be fully abstract with...
متن کاملAxiomatizing GSOS with Predicates
In this paper, we introduce an extension of the GSOS rule format with predicates such as termination, convergence and divergence. For this format we generalize the technique proposed by Aceto, Bloom and Vaandrager for the automatic generation of ground-complete axiomatizations of bisimilarity over GSOS systems. Our procedure is implemented in a tool that receives SOS specifications as input and...
متن کاملTurning SOS Rules into Equations
Many process algebras are deened by structural operational semantics (SOS). Indeed , most such deenitions are nicely structured and t the GSOS format of 15]. We give a procedure for converting any GSOS language deenition to a nite complete equa-tional axiom system (possibly with one innnitary induction principle) which precisely characterizes strong bisimulation of processes.
متن کامل